Temporalising Separation Logic for Planning with Search Control Knowledge
نویسندگان
چکیده
Temporal logics are widely adopted in Artificial Intelligence (AI) planning for specifying Search Control Knowledge (SCK). However, traditional temporal logics are limited in expressive power since they are unable to express spatial constraints which are as important as temporal ones in many planning domains. To this end, we propose a twodimensional (spatial and temporal) logic namely PPTL by temporalising separation logic with Propositional Projection Temporal Logic (PPTL). The new logic is well-suited for specifying SCK containing both spatial and temporal constraints which are useful in AI planning. We show that PPTL is decidable and present a decision procedure. With this basis, a planner namely S-TSolver for computing plans based on the spatio-temporal SCK expressed in PPTL formulas is developed. Evaluation on some selected benchmark domains shows the effectiveness of S-TSolver.
منابع مشابه
Adding a temporal dimension to a logic system
We introduce a methodology whereby an arbitrary logic system L can be en riched with temporal features to create a new system T L The new system is constructed by combining L with a pure propositional temporal logic T such as linear temporal logic with Since and Until in a special way We refer to this method as adding a temporal dimension to L or just temporalising L We show that the logic syst...
متن کاملUsing temporal logics to express search control knowledge for planning
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from combinatorial complexity even in simple domains. Theoretical results demonstrate that planning is in the worst case intractable. Nevertheless, planning in particular domains can often be made tractable by utilizing add...
متن کاملA General LTL Framework for Describing Control Knowledge in Classical Planning
State-of-the-art planning systems use a variety of control knowledge in order to enhance the performance of heuristic search. Unfortunately most forms of control knowledge use a specific formalism which makes them hard to combine. There have been several approaches which describe control knowledge in Linear Temporal Logic (LTL). We build upon this work and propose a general framework for encodi...
متن کاملCombining Macro-operators with Control Knowledge
Inductive Logic Programming (ilp) methods have proven to succesfully acquire knowledge in very different learning paradigms, such as supervised and unsupervised learning or relational reinforcement learning. However, very little has been done on General Problem Solving (gps). One of the ilp-based approaches applied to gps is hamlet. This method is able to learn control rules (heuristics) for a ...
متن کاملUsing Temporal Logic to Control Search in a Forward Chaining Planner
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from combinatorial explosion. Indeed, recent theoretical results demonstrate that such an explosion is inevitable. It has long been acknowledged that domain independent planners need domain dependent information to help the...
متن کامل